A Taxonomy of Meta-learning Techniques and Proposed Framework for Automated Landmarker Generation and Selection

نویسنده

  • Daren Ler
چکیده

Many different perspectives have been adopted regarding the form of learning labelled as metalearning, with little to no consensus as to a proper definition. As such, a general definition and taxonomy of meta-learning techniques defined, segmenting meta-learning into two categories: mono-problem and multi-problem. A further taxonomy of multi-problem metalearning methods is then described, emphasizing the relationships between these, and how they apply to a general architecture for self-adaptive learning given by Vilalta and Drissi (2002). In addition, the recent migration toward the generation of better meta-data is discussed, along with a proposed framework for the potential automated generation of meta-attributes or landmarkers for algorithm selection.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hill-Climbing Landmarker Generation Algorithm Based on Efficiency and Correlativity Criteria

For a given classification task, there are typically several learning algorithms available. The question then arises: which is the most appropriate algorithm to apply. We recently proposed a new algorithm for making such a selection based on landmarking a recent meta-learning strategy that utilises meta-features that are themselves efficient learning algorithms. This algorithm, which creates a ...

متن کامل

A Landmarker Selection Algorithm Based on Correlation and Efficiency Criteria

Landmarking is a recent and promising meta-learning strategy, which defines meta-features that are themselves efficient learning algorithms. However, the choice of landmarkers is often made in an ad hoc manner. In this paper, we propose a new perspective and set of criteria for landmarkers. Based on the new criteria, we propose a landmarker generation algorithm, which generates a set of landmar...

متن کامل

Sequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...

متن کامل

Bridging the semantic gap for software effort estimation by hierarchical feature selection techniques

Software project management is one of the significant activates in the software development process. Software Development Effort Estimation (SDEE) is a challenging task in the software project management. SDEE is an old activity in computer industry from 1940s and has been reviewed several times. A SDEE model is appropriate if it provides the accuracy and confidence simultaneously before softwa...

متن کامل

Sequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004